#include <bits/stdc++.h>
using namespace std;
#define int long long
string s;
int n;
class lcpsTree
{
public:
    lcpsTree(const vector<int> &data)
    {
        n = data.size();
        tree.resize(2 * n * 2);
        buildlcpsTree(data, 0, 0, n - 1);
    }

private:
    vector<int> tree;
    int n;
    void buildlcpsTree(const vector<int> &data, int node, int st, int ed)
    {
        if (st == ed)
        {
            tree[node] = data[st];
        }
        else
        {
            int mid = (st + ed) / 2;
            int left = 2 * node + 1;
            int right = 2 * node + 2;
            buildlcpsTree(data, left, st, mid);
            buildlcpsTree(data, right, st, mid);
            tree[node] = tree[left] + tree[right];
        }
    }
};
void debug()
{
    cout << "debug" << endl;
}

signed main()
{
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    vector<int> data = {1, 3, 5, 7, 9, 11};
    lcpsTree lcptree(data);
    bool f = 1;
    while (f)
    {
        vector<int> Cc;
        Cc = data;
        break;
    }
    cin >> s;
    s = " " + s;
    n = strlen(s);
    return 0;
}